evaluating project’s completion time with q-learning

Authors

mohammad abdolshah

abstract

nowadays project management is a key component in introductory operations management. the educators and the researchers in these areas advocate representing a project as a network and applying the solution approaches for network models to them to assist project managers to monitor their completion. in this paper, we evaluated project’s completion time utilizing the q-learning algorithm. so the new algorithm is proposed to solve completion time project. then, we run this algorithm in example network in matlab. the results showed that the algorithm has achieved the best time to complete the project.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Evaluating project’s completion time with Q-learning

Nowadays project management is a key component in introductory operations management. The educators and the researchers in these areas advocate representing a project as a network and applying the solution approaches for network models to them to assist project managers to monitor their completion. In this paper, we evaluated project’s completion time utilizing the Q-learning algorithm. So the ...

full text

Evaluating project’s completion time with Q-learning

Nowadays project management is a key component in introductory operations management. The educators and the researchers in these areas advocate representing a project as a network and applying the solution approaches for network models to them to assist project managers to monitor their completion. In this paper, we evaluated project’s completion time utilizing the Q-learning algorithm. So the ...

full text

The Q-matrix completion problem

Abstract. A real n × n matrix is a Q-matrix if for every k = 1, 2, . . . , n the sum of all k × k principal minors is positive. A digraph D is said to have Q-completion if every partial Q-matrix specifying D can be completed to a Q-matrix. For the Q-completion problem, sufficient conditions for a digraph to have Q-completion are given, necessary conditions for a digraph to have Q-completion are...

full text

Fuzzy completion time for alternative stochastic networks

In this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. In other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of network. Then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (TFN). This paper com...

full text

Evaluating an Intelligent Q&A System for Mobile Cultural Learning

The paper presents a user study designed to evaluate the impact of an intelligent Question and Answering (Q&A) system for mobile cultural learning on the user’s subjective impressions and retention performance. We have chosen a recent pedagogical framework for mobile learning as a theoretical foundation for this work. The framework postulates four types of mobile learning from which we have cho...

full text

A New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time

Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of information, security and systems management

Publisher: islamic azad university e-branch

ISSN 2251-9335

volume 4

issue 2 2015

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023